Authenticity green coffee bean species and geographical origin using near-infrared spectroscopy combined with chemometrics

To prevent the adulteration of agricultural resources and provide a solution to enhance the green coffee bean supply chain, authentication using the near-infrared spectroscopy (NIRS) technique was investigated. Partial least square with discrimination analysis (PLS-DA) models combined with various preprocessing methods were built from NIR spectra of 153 Vietnamese green coffee samples. The model combined with the standard normal variate and the first order of derivative yielded excellent performance in predicting coffee species with the error cross-validation of 0.0261. PLS-DA model of mean centre and first-order derivative spectra also yielded good performance in verifying geographical indication of green coffee with the error of 0.0656. By contrast, the predicting abilities of post-harvest methods were poor. The overall results showed a high potential of the NIRS in online authentication practices.     

基于三维胞元空间的MA双向并行路由算法

针对传统移动代理(MA)在监测无线传感器网络(WSNs)的感兴趣信息时产生的延迟较大和能耗较多问题,提出了基于三维胞元空间的MA双向并行(3D-BPMA)路由算法.3D-BPMA将MA与传统的客户/服务器(c/S)模式相结合,在胞元内利用C/S模式搜集信息,在单层胞元系统和路由器与路由器之间采用MA双向并行的策略进行传输.仿真结果表明:3D-BPMA与LCF,DSG-MIP算法相比减少了平均响应时间和网络平均能耗,提高了MA发送率.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

基于免疫--蚂蚁算法的多约束QoS路由选择

针对多约束QoS路由选择问题,将其转化为一个多约束赋权图最短路径问题,选择费用、带宽、时延、丢失率为QoS参数。借鉴人体免疫系统的适应能力和蚂蚁算法的全局寻优能力提出了一种新的融合算法即免疫——蚂蚁算法。免疫算法把目标函数和制约条件作为抗原,目标函数的优化解对应为抗体,使得求解过程的收敛方向得以控制;利用蚂蚁算法产生和更新抗体,抗体交叉、变异操作以及对与抗原亲和力高的抗体进行记忆,均能促进快速求解。实验结果表明:免疫——蚂蚁算法表现出了超越免疫算法和蚂蚁算法的优点,大幅度提高了路由选择的效率。     

无线Ad hoc 网络及其研究难点

无线Ad hoc网络作为没有基础设施的网络，在军事和民用方面具有广阔的应用前景，是目前网络研究中的热点问题。本文对无线Ad hoc网络进行了详细的论述，指出了目前研究中存在的一些难点。     

一种自动布线方法：多级线探索法

本文介绍了一种在微机上实现的印制板自动布线方法──多级线探索法及其编程方法。这种方法是基于完备布线算法的概念，通过分析李氏算法和传统线探索法的不足之处而得到的。虽然它也是一种线探索法，但有较传统线探索法更强的探索能力，不需要结合李氏算法而能单独完成布线任务，是一种较理想的算法，通过实验获得了较为满意的效果。     

一种支持QoS的拓扑自适应动态组播路由算法

YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开，同时为接收方提供多个可选择的组播接入路径，以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长，可扩展性不好等问题。本文在分析这些算法的基础上，提出改进的支持QoS的动态组播路由算法，即拓扑自适应动态组播路由（Topology Adaptive Dynamic Multicast Routing，TADMR）算法。该算法避免了以往算法中大部分盲目的路径搜索，并使结点加入时延不再受限于固定的等待时钟，而与网络拓扑相自适应。性能分析和仿真结果表明，该算法具有较低的控制信令开销和结点加入时延，适用于各种网络规模和群组规模，具有良好的可扩展性。     

自动交换光网络中的信令与路由

自动交换光网络的概念一经提出即受到业界的广泛关注，运营商尤其对其寄予了厚望。本文首先概要地介绍了ASON的优点，然后重点论述了ASON的信令与路由功能，包括对它们的要求以及标准化工作。     

Optimal algorithms for adjacent side routing

We consider the switchbox routing problem of two-terminal nets in the case when all thek nets lie on two adjacent sides of the rectangle. Our routing model is the standard two-layer model. We develop an optimal algorithm that routes all the nets whenever a routing exists. The routing obtained uses the fewest possible number of vias. A more general version of this problem (adjacent staircase) is also optimally solved.This research was supported in part by NSA Contract No. MDA-904-85H-0015, NSF Grant No. DCR-86-00378, and by NSF Engineering Research Centers Program NSFD CDR 88003012.